A Parallel Time-Memory-Processor Tradeoff O(2) for Knapsack-like NP-Complete Problems

A general-purpose parallel three-list six-table algorithm that can solve a number of knapsack-like NP-complete problems is developed in this paper. This kind of problems includes knapsack problem, exact satisfiability problem, set covering problem, etc. Running on an EREW PRAM model, The proposed parallel algorithm can find a solution of these problems of size n in O(2) time, with O(2) space and O(2) processors, resulting in a time-space-processor tradeoff of O(2). The performance analysis and comparisons show that it is both work and space efficient, and thus is an improved result over the past researches. Since it can break greater variables knapsack-based cryptosystems and watermark, the new algorithm has some cryptanalytic significance.